Some n by dn linear complementarity problems
نویسندگان
چکیده
منابع مشابه
Improved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملMatrix Linear Complementarity Problems
We consider the expected residual minimization formulation of the stochastic R0 matrix linear complementarity problem. We show that the involved matrix being a stochastic R0 matrix is a necessary and sufficient condition for the solution set of the expected residual minimization problem to be nonempty and bounded. Moreover, local and global error bounds are given for the stochastic R0 matrix li...
متن کاملParametric Linear Complementarity Problems
We study linear complementarity problems depending on parameters in the right-hand side and (or) in the matrix. For the case that all elements of the right-hand side are independent parameters we give a new proof for the equivalence of three diierent important local properties of the corresponding solution set map in a neighbourhood of an element of its graph. For one-and multiparametric proble...
متن کاملLinear Complementarity Problems
In this paper, we first present a brief review about the feasible interior-point algorithm for P∗(κ)-horizontal linear complementarity problems (HLCPs) based on new directions. Then we present a new infeasible interior-point algorithm for these problems. The algorithm uses two types of full-Newton steps which are called feasibility steps and centering steps. The algorithm starts from strictly f...
متن کاملSparse solutions of linear complementarity problems
This paper considers the characterization and computation of sparse solutions and leastp-norm (0 < p < 1) solutions of the linear complementarity problems LCP(q,M). We show that the number of non-zero entries of any least-p-norm solution of the LCP(q,M) is less than or equal to the rank of M for any arbitrary matrix M and any number p ∈ (0, 1), and there is p̄ ∈ (0, 1) such that all least-p-norm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1980
ISSN: 0024-3795
DOI: 10.1016/0024-3795(80)90170-6